|
In computer science, PPAD (''"Polynomial Parity Arguments on Directed graphs"'') is a complexity class introduced by Christos Papadimitriou in 1994. PPAD is a subclass of TFNP based on functions that can be shown to be total by a parity argument. The class attracted significant attention in the field of algorithmic game theory because it contains the problem of computing a Nash equilibrium, and this problem was shown by Chen and Deng in 2005 to be complete for the class.〔 *. 〕 PPAD is a class of problems that are believed to be hard, but obtaining PPAD-completeness is a weaker evidence of intractability than that of obtaining NP-completeness. PPAD problems cannot be NP-complete, for the technical reason that NP is a class of decision problems, but the answer of PPAD problems is always yes, as a solution is known to exist, even though it might be hard to find that solution. It could still be the case that PPAD is the same class as P, and still have that P NP, though it seems unlikely. Examples of PPAD-complete problems include finding Nash equilibria, Brouwer and Borsuk-Ulam fixpoints, finding Arrow-Debreu equilibria in markets and more.〔 The Ham sandwich theorem is known to lie in PPAD but it remains an open question as to whether or not it is PPAD-complete. ==Definition== PPAD is a subset of the class TFNP, the class of function problems in FNP that are guaranteed to be total. The TFNP formal definition is given as follows: :A binary relation P(''x'',''y'') is in TFNP if and only if there is a deterministic polynomial time algorithm that can determine whether P(''x'',''y'') holds given both ''x'' and ''y'', and for every ''x'', there exists a ''y'' such that P(''x'',''y'') holds. Subclasses of TFNP are defined based on the type of mathematical proof used to prove that a solution always exists. Informally, PPAD is the subclass of TFNP where the guarantee that there exists a ''y'' such that P(''x'',''y'') holds is based on a parity argument on a directed graph. The class is formally defined by specifying one of its complete problems, known as ''End-Of-The-Line'': :G is a (possibly exponentially large) directed graph with no isolated vertices, and with every vertex having at most one predecessor and one successor. G is specified by giving a polynomial-time computable function f(''v'') (polynomial in the size of ''v'') that returns the predecessor and successor (if they exist) of the vertex ''v''. Given a vertex ''s'' in G with no predecessor, find a vertex ''t≠s'' with no predecessor or no successor. (The input to the problem is the source vertex ''s'' and the function f(''v'')). In other words, we want any source or sink of the directed graph other than ''s''. Such a ''t'' must exist if an ''s'' does, because the structure of G means that vertices with only one neighbour come in pairs. In particular, given ''s'', we can find such a ''t'' at the other end of the string starting at ''s''. (Note that this may take exponential time if we just evaluate f repeatedly.) 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「PPAD (complexity)」の詳細全文を読む スポンサード リンク
|